Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Showing 1 - 3 of 3 matches in All Departments
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.
This Festschrift, in honour of Professor Franz Guenthner's sixtieth birthday, presented by some of his friends and colleagues, covers the whole area of automatic language processing, of which he is an eminent specialist. The topics covered range from the semantics of natural languages to predicate grammar, from local grammars to efficient finite-state techniques and from Internet search engines to the design of electronic dictionaries. They all bear tribute to Franz Guenthner's ambition to make computational lingusitics a truly experimental science.
This volume contains papers presented at the first international workshop onword equations and related topics held at the University of T}bingen in October 1990. Word equations, the central topic of this annual workshop, lieat the intersection of several important areas of computer science, suchas unification theory, combinatorics on words, list processing, and constraint logic programming. The workshop is a forum where researchers fromthese different domains may present and discuss results and ideas, thereby supporting interaction and cross-fertilization between theoretical questions and practical applications. The volume collects papers which: - contain new and relevant results, - describe a new approach to a subject, or - give a survey of main developments in an area. Papers cover investigations on free groups, associative unification and Makanin's algorithm to decide the solvability of equations in free semigroups, general unification theory and its relationship to algebra and model theory, Thue systems, and finitely presented groups.
|
You may like...
|